翻訳と辞書 Words near each other ・ Banabuiú River ・ Banacek ・ Banach *-algebra ・ Banach algebra ・ Banach algebra cohomology ・ Banach bundle ・ Banach bundle (non-commutative geometry) ・ Banach fixed-point theorem ・ Banach function algebra ・ Banach game ・ Banach Journal of Mathematical Analysis ・ Banach limit ・ Banach manifold ・ Banach measure ・ Banach space ・ Banach's matchbox problem ・ Banachek ・ Banachiewicz (crater) ・ Banachy ・ Banach–Alaoglu theorem ・ Banach–Mazur compactum ・ Banach–Mazur game ・ Banach–Mazur theorem ・ Banach–Stone theorem ・ Banach–Tarski paradox ・ Banadak Sadat ・ BANADESA ・ Banadir Hospital ・ Banadir Stadium ・ Banadkuk Rural District Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Banach's matchbox problem ： ウィキペディア英語版 Banach's matchbox problem Banach's match problem is a classic problem in probability attributed to Stefan Banach. Feller 〔 Feller, William, An Introduction to Probability Theory And Its Applications, Third Edition, Wiley, 1968, Chapter VI, section 8 〕 says that the problem was inspired by a humorous reference to Banach's smoking habit in a speech honouring him by H. Steinhaus, but that it was not Banach who set the problem or provided an answer. Suppose a mathematician carries two matchboxes at all times: one in his left pocket and one in his right. Each time he needs a match, he is equally likely to take it from either pocket. Suppose he reaches into his pocket and discovers for the first time that the box picked is empty. If it is assumed that each of the matchboxes originally contained $N$ matches, what is the probability that there are exactly $k$ matches in the other box? ==Solution== Without loss of generality consider the case where the matchbox in his right pocket has an unlimited number of matches and let M be the number of matches removed from this one before the left one is found to be empty. When the left pocket is found to be empty, the man has chosen that pocket (N+1) times. Then M is the number of successes before (N+1) failures in Bernoulli trials with p=1/2, which has the negative binomial distribution and thus :$P()\; =\; \backslash binom\backslash left(\backslash frac\backslash right)^$. Returning to the original problem, we see that the probability that the left pocket is found to be empty first is which equals 1/2 because both are equally likely. We see that the number K of matches remaining in the other pocket is :. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Banach's matchbox problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.